Finite field arithmetic

Results: 53



#Item
21Galois Field in Cryptography Christoforus Juan Benvenuto May 31, 2012 Abstract This paper introduces the basics of Galois Field as well as its implementation in storing data. This paper shows and helps visualizes that st

Galois Field in Cryptography Christoforus Juan Benvenuto May 31, 2012 Abstract This paper introduces the basics of Galois Field as well as its implementation in storing data. This paper shows and helps visualizes that st

Add to Reading List

Source URL: www.math.washington.edu

Language: English - Date: 2012-06-11 18:41:39
22Feature  Finite Field Arithmetic for Cryptography  Erkay Savas¸ and

Feature Finite Field Arithmetic for Cryptography Erkay Savas¸ and

Add to Reading List

Source URL: www.cs.ucsb.edu

Language: English - Date: 2010-05-29 22:43:04
23Fast arithmetic and pairing evaluation on genus 2 curves David Freeman University of California, Berkeley [removed] November 6, 2005

Fast arithmetic and pairing evaluation on genus 2 curves David Freeman University of California, Berkeley [removed] November 6, 2005

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2008-06-06 19:27:47
24A SCALABLE SYSTEM-ON-A-CHIP ARCHITECTURE FOR PRIME NUMBER VALIDATION Ray C.C. Cheung and Ashley Brown Department of Computing, Imperial College London, United Kingdom Abstract This paper presents a scalable SoC architect

A SCALABLE SYSTEM-ON-A-CHIP ARCHITECTURE FOR PRIME NUMBER VALIDATION Ray C.C. Cheung and Ashley Brown Department of Computing, Imperial College London, United Kingdom Abstract This paper presents a scalable SoC architect

Add to Reading List

Source URL: www.ashleybrown.co.uk

Language: English - Date: 2010-09-16 09:55:04
25ON DEFINING INTEGERS AND PROVING ARITHMETIC CIRCUIT LOWER BOUNDS ¨rgisser Peter Bu Abstract. Let τ (n) denote the minimum number of arithmetic operations sufficient to build the integer n from the constant 1. We prove

ON DEFINING INTEGERS AND PROVING ARITHMETIC CIRCUIT LOWER BOUNDS ¨rgisser Peter Bu Abstract. Let τ (n) denote the minimum number of arithmetic operations sufficient to build the integer n from the constant 1. We prove

Add to Reading List

Source URL: math-www.uni-paderborn.de

Language: English - Date: 2007-06-22 04:55:31
26AN ABSTRACT OF THE THESIS OF Francisco Rodrguez-Henrquez for the degree of Doctor of Philosophy in Electrical & Computer Engineering presented on June 07, 2000. Title: New Algorithms and Architectures for Arithmetic

AN ABSTRACT OF THE THESIS OF Francisco Rodrguez-Henrquez for the degree of Doctor of Philosophy in Electrical & Computer Engineering presented on June 07, 2000. Title: New Algorithms and Architectures for Arithmetic

Add to Reading List

Source URL: delta.cs.cinvestav.mx

Language: English - Date: 2005-02-12 19:20:36
27Open Problems on Exponential and Character Sums Igor E. Shparlinski Department of Computing, Macquarie University Sydney, NSW 2109, Australia [removed]

Open Problems on Exponential and Character Sums Igor E. Shparlinski Department of Computing, Macquarie University Sydney, NSW 2109, Australia [removed]

Add to Reading List

Source URL: web.science.mq.edu.au

Language: English - Date: 2013-04-07 21:19:17
28Optimal software-implemented Itoh–Tsujii inversion for F2m Jeremy Maitin-Shepard [removed] University of California at Berkeley  Abstract

Optimal software-implemented Itoh–Tsujii inversion for F2m Jeremy Maitin-Shepard [removed] University of California at Berkeley Abstract

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2015-01-13 04:01:36
29Working with Signed Numbers.pub

Working with Signed Numbers.pub

Add to Reading List

Source URL: www.cc.viu.ca

Language: English - Date: 2013-08-06 19:32:44
30ON THE 4-RANK OF CLASS GROUPS OF QUADRATIC NUMBER FIELDS DJORDJO MILOVIC ´ ´ PARIS-SUD 11 ADVISOR: ETIENNE

ON THE 4-RANK OF CLASS GROUPS OF QUADRATIC NUMBER FIELDS DJORDJO MILOVIC ´ ´ PARIS-SUD 11 ADVISOR: ETIENNE

Add to Reading List

Source URL: www.algant.eu

Language: English - Date: 2013-07-05 07:44:32